首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   606篇
  免费   25篇
  国内免费   61篇
化学   4篇
综合类   6篇
数学   424篇
物理学   7篇
综合类   251篇
  2023年   3篇
  2022年   6篇
  2021年   2篇
  2020年   10篇
  2019年   16篇
  2018年   14篇
  2017年   24篇
  2016年   7篇
  2015年   14篇
  2014年   21篇
  2013年   104篇
  2012年   16篇
  2011年   49篇
  2010年   23篇
  2009年   47篇
  2008年   32篇
  2007年   39篇
  2006年   26篇
  2005年   40篇
  2004年   25篇
  2003年   28篇
  2002年   13篇
  2001年   22篇
  2000年   14篇
  1999年   16篇
  1998年   11篇
  1997年   21篇
  1996年   9篇
  1995年   5篇
  1994年   6篇
  1993年   5篇
  1992年   1篇
  1991年   4篇
  1990年   3篇
  1989年   5篇
  1988年   3篇
  1987年   2篇
  1986年   2篇
  1982年   1篇
  1979年   1篇
  1959年   2篇
排序方式: 共有692条查询结果,搜索用时 265 毫秒
1.
2.
G是所有非幂零极大子群皆正规的有限群,不应用群G的可解性,证明了G具有Sylow塔。  相似文献   
3.
Khalid Bou-Rabee  Chen Shi 《代数通讯》2017,45(10):4370-4379
The commensurability index between two subgroups A,B of a group G is [A:AB][B:AB]. This gives a notion of distance among finite index subgroups of G, which is encoded in the p-local commensurability graphs of G. We show that for any metabelian group, any component of the p-local commensurabilty graph of G has diameter bounded above by 4. However, no universal upper bound on diameters of components exists for the class of finite solvable groups. In the appendix we give a complete classification of components for upper triangular matrix groups in GL(2,𝔽q).  相似文献   
4.
Juping Tang 《代数通讯》2017,45(7):3017-3021
A subgroup A of a finite group G is called {1≤G}-embedded in G if for each two subgroups KH of G, where K is a maximal subgroup of H, A either covers the pair (K,H) or avoids it. Moreover, a subgroup H of G is called nearly m-embedded in G if G has a subgroup T and a {1≤G}-embedded subgroup C such that G?=?HT and HTCH. In this paper, we mainly prove that G is solvable if and only if its Sylow 3-subgroups, Sylow 5-subgroups and Sylow 7-subgroups are nearly m-embedded in G.  相似文献   
5.
Jairo Z. Goncalves 《代数通讯》2017,45(12):5193-5201
Let k(t) be the field of rational functions over the field k, let σ be a k-automorphism of K = k(t), let D = K(X;σ) be the ring of fractions of the skew polynomial ring K[X;σ], and let D? be the multiplicative group of D. We show that if N is a noncentral normal subgroup of D?, then N contains a free subgroup. We also prove that when k is algebraically closed and σ has infinite order, there exists a specialization from D to a quaternion algebra. This allows us to explicitly present free subgroups in D?.  相似文献   
6.
Assume G is a finite group and H a subgroup of G. If there exists a subgroup K of G such that G = HK and HK = 1, then K is said to be a complement to H in G. A finite p-group G is called an NC-group if all its proper normal subgroups not contained in Φ(G) have complements. In this paper, some properties of NC-groups are investigated and some classes of NC-groups are classified.  相似文献   
7.
研究了有限群的超可解性问题,结合共轭置换子群与半正规子群的概念,在群G的极大子群(2-极大子群)或共轭置换或半正规的条件下给出了群G超可解的若干充分条件.  相似文献   
8.
本文分类了$G/H^G$循环的有限$p$群$G$, 其中$H$为$G$的任意极小非正规子群, $H^G$ 为$H$在$G$中的正规闭包.  相似文献   
9.
Increasing interest in studying community structures, or clusters in complex networks arising in various applications has led to a large and diverse body of literature introducing numerous graph-theoretic models relaxing certain characteristics of the classical clique concept. This paper analyzes the elementary clique-defining properties implicitly exploited in the available clique relaxation models and proposes a taxonomic framework that not only allows to classify the existing models in a systematic fashion, but also yields new clique relaxations of potential practical interest. Some basic structural properties of several of the considered models are identified that may facilitate the choice of methods for solving the corresponding optimization problems. In addition, bounds describing the cohesiveness properties of different clique relaxation structures are established, and practical implications of choosing one model over another are discussed.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号